A Meta-heuristic Algorithm for Global Numerical Optimization Problems inspired by Vortex in fluid physics

Authors

  • Mashhadi Mohammad Reza , N. Department of Electrical and Computer Engineering, Babol Noshirvani University of Technology, Babol, Iran.
  • Omranpour, H. Department of Electrical and Computer Engineering, Babol Noshirvani University of Technology, Babol, Iran.
Abstract:

One of the most important issues in engineering is to find the optimal global points of the functions used. It is not easy to find such a point in some functions due to the reasons such as large number of dimensions or inability to derive them from the function. Also in engineering modeling, we do not have the relationships of many functions, but we can input and output them as a black box. Therefore, the meta-heuristic algorithms are presented. In this paper, a meta-heuristic algorithm based on the behavior of vortices in fluid physics is presented. Technically, the algorithm is made up of vortices. Each vortex contains some particles. The particles move by the presented rotation matrix. This movement causes the local search. Also by selecting another vortex through the selection algorithm, each vortex attempts to escape the local optima and reach the global optima. The algorithm will explore and exploit the given function using its operators. Another innovation of this paper is the introduction of two new evaluation criteria for optimization algorithms. These two criteria show the behavior and convergence of algorithms along the way to reach the global optimal point or fall into the local optima. The proposed algorithm has been implemented, evaluated and compared with the numerical optimization state of the art algorithms. It was observed that the proposed method was able to achieve better results than most of the other methods in the major of twenty-four standard functions in different dimensions.  (All codes available at http://web.nit.ac.ir/ h.omranpour/.).

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A NOVEL META-HEURISTIC ALGORITHM: TUG OF WAR OPTIMIZATION

This paper presents a novel population-based meta-heuristic algorithm inspired by the game of tug of war. Utilizing a sport metaphor the algorithm, denoted as Tug of War Optimization (TWO), considers each candidate solution as a team participating in a series of rope pulling competitions.  The  teams  exert  pulling  forces  on  each  other...

full text

Orthogonal chemical reaction optimization algorithm for global numerical optimization problems

Chemical reaction optimization (CRO) is a newly proposed, easy to implement metaheuristic inspired by the phenomena between molecules in chemical reactions. However, CRO behaves like a random search to traverse the whole solution space, which could confine the algorithm’s search ability. The orthogonal experimental design (OED) method is a robust-design method that can obtain the best combinati...

full text

Global Bacteria Optimization Meta-Heuristic Algorithm for Jobshop Scheduling

This paper examines the problem of jobshop scheduling with either makespan minimization or total tardiness minimization, which are both known to be NP-hard. The authors propose the use of a meta-heuristic procedure inspired from bacterial phototaxis. This procedure, called Global Bacteria Optimization (GBO), emulates the reaction of some organisms (bacteria) to light stimulation. Computational ...

full text

BQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems

Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...

full text

Introducing a new meta-heuristic algorithm based on See-See Partridge Chicks Optimization to solve dynamic optimization problems

The SSPCO (See-See Particle Chicks Optimization) is a type of swarm intelligence algorithm derived from the behavior of See-See Partridge. Although efficiency of this algorithm has been proven for solving static optimization problems, it has not yet been tested to solve dynamic optimization problems. Due to the nature of NP-Hard dynamic problems, this algorithm alone is not able to solve such o...

full text

A Novel Adapted Multi-objective Meta-heuristic Algorithm for a Flexible Bi-objective Scheduling Problem Based on Physics Theory

  We relax some assumptions of the traditional scheduling problem and suggest an adapted meta-heuristic algorithm to optimize efficient utilization of resources and quick response to demands simultaneously. We intend to bridge the existing gap between theory and real industrial scheduling assumptions (e.g., hot metal rolling industry, chemical and pharmaceutical industries). We adapt and evalua...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 41  issue 1

pages  99- 117

publication date 2022-09

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

No Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023